Binary Pattern Tile Set Synthesis Is NP-Hard
نویسندگان
چکیده
منابع مشابه
Tile Packing Tomography is NP-hard
Discrete tomography deals with reconstructing finite spatial objects from their projections. The objects we study in this paper are called tilings or tile-packings, and they consist of a number of disjoint copies of a fixed tile, where a tile is defined as a connected set of grid points. A row projection specifies how many grid points are covered by tiles in a given row; column projections are ...
متن کاملA manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tile set synthesis
Patterned self-assembly tile set synthesis (Pats) aims at finding a minimum tile set to uniquely self-assemble a given rectangular (color) pattern. For k ≥ 1, k-Pats is a variant of Pats that restricts input patterns to those with at most k colors. A computer-assisted proof has been recently proposed for 2-Pats by Kari et al. [arXiv:1404.0967 (2014)]. In contrast, the best known manually-checka...
متن کاملProjection Onto The k-Cosparse Set is NP-Hard
We investigate the computational complexity of a problem arising in the context of sparse optimization, namely, the projection onto the set of k-cosparse vectors w.r.t. some given matrix Ω. We show that this projection problem is (strongly) NP-hard, even in the special cases where the matrix Ω contains only ternary or bipolar coefficients. Interestingly, this is in stark contrast to the project...
متن کاملRecognizing Members of the Tournament Equilibrium Set is NP-hard
A recurring theme in the mathematical social sciences is how to select the “most desirable” elements given some binary dominance relation on a set of alternatives. Schwartz’s Tournament Equilibrium set (TEQ) ranks among the most intriguing, but also among the most enigmatic, tournament solutions that have been proposed so far in this context. Due to its unwieldy recursive definition, little is ...
متن کاملTrainyard is NP-hard
Recently, due to the widespread diffusion of smart-phones, mobile puzzle games have experienced a huge increase in their popularity. A successful puzzle has to be both captivating and challenging, and it has been suggested that this features are somehow related to their computational complexity [5]. Indeed, many puzzle games – such as Mah-Jongg, Sokoban, Candy Crush, and 2048, to name a few – a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2016
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-016-0154-7